Strictly Nonzero Charges

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Strictly Nonzero Integer-valued Charges

A charge (finitely additive measure) defined on a Boolean algebra of sets taking values in a group G is called a strictly nonzero (SNZ) charge if it takes the identity value in G only for the zero element of the Boolean algebra. A study of such charges was initiated by Rudiger Göbel and KPS Bhaskara Rao in 2002 [3]. Our main result is a solution to one of the questions posed in that paper: we s...

متن کامل

Classification of quasifinite representations with nonzero central charges for type A1 EALA with coordinates in quantum torus

In this paper, we first construct a Lie algebra L from rank 3 quantum torus, and show that it is isomorphic to the core of EALAs of type A1 with coordinates in rank 2 quantum torus. Then we construct two classes of irreducible Z-graded highest weight representations, and give the necessary and sufficient conditions for these representations to be quasifinite. Next, we prove that they exhaust al...

متن کامل

Nonzero Classical Discord.

Quantum discord is the quantitative difference between two alternative expressions for bipartite mutual information, given respectively in terms of two distinct definitions for the conditional entropy. By constructing a stochastic model of shared states, classical discord can be similarly defined, quantifying the presence of some stochasticity in the measurement process. Therefore, discord can ...

متن کامل

Alternating Nonzero Automata

We introduce a new class of automata on infinite trees called alternating nonzero automata, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same problem for non-deterministic ones, which implies decidability. We obtain as a corollary algorithms for the satisfiability of a probabilistic temporal logic extendin...

متن کامل

Strictly Pretty

Pretty printers are tools for formatting structured text. A recently taken algebraic approach has lead to a systematic design of pretty printers. Wadler has proposed such an algebraic pretty printer together with an implementation for the lazy functional language Haskell. The original design causes exponential complexity when literally used in a strict language. This note recalls some propertie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 2002

ISSN: 0035-7596

DOI: 10.1216/rmjm/1181070030